#include<iostream>
#include<cstring>
using namespace std;
const int N = 1e3 + 10, M = N * 2;
int h[N], ne[M], idx, e[M];
int d[N];
int n, m;
int q[M * M];
void add(int a, int b)
{
	e[idx] = b;
	ne[idx] = h[a];
	h[a] = idx++;
}
void toupu()
{
	int hh = 0, tt = -1;
	for (int i = 1; i <= n; i++) {
		if (d[i] == 0) {
			q[++tt] = i;
		}
	}
	while (hh <= tt) {
		int t = q[hh++];
		for (int i = h[t]; ~i; i = ne[i]) {
			int j = e[i];
			if (--d[j] == 0) {
				q[++tt] = j;
			}
		}
	}
}
int main()
{
	cin >> n >> m;
	memset(h, -1, sizeof(h));
	while (m--) {
		int a, b;
		cin >> a >> b;
		d[b]++;
		add(a, b);
	}
	toupu();
	for (int i = 0; i < n; i++) {
		cout << q[i] << " ";
	}
	return 0;
}